On characteristic sets and degrees of finite automata

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

ON THE CHARACTERISTIC DEGREE OF FINITE GROUPS

In this article we introduce and study the concept of characteristic degree of a subgroup in a finite group. We define the characteristic degree of a subgroup H in a finite group G as the ratio of the number of all pairs (h,α) ∈ H×Aut(G) such that h^α∈H, by the order of H × Aut(G), where Aut(G) is the automorphisms group of G. This quantity measures the probability that H can be characteristic ...

متن کامل

Finite Special Moufang Sets of Odd Characteristic

In this paper we classify finite special Moufang sets M(U, τ ) of odd characteristic. The characteristic 2 case was handled in another paper by De Medts and the author. We prove, using elementary means that U is elementary abelian. Then we show that M(U, τ ) is the unique Moufang set whose little projective group is PSL2(|U |). The emphasis of this paper is on obtaining elementary proofs. Secti...

متن کامل

Arithmetic Meyer sets and finite automata

Non-standard number representation has proved to be useful in the speed-up of some algorithms, and in the modelization of solids called quasicrystals. Using tools from automata theory we study the set Zβ of β-integers, that is, the set of real numbers which have a zero fractional part when expanded in a real base β, for a given β > 1. In particular, when β is a Pisot number — like the golden me...

متن کامل

Turing Degrees of Limit Sets of Cellular Automata

Cellular automata are discrete dynamical systems and a model of computation. The limit set of a cellular automaton consists of the configurations having an infinite sequence of preimages. It is well known that these always contain a computable point and that any non-trivial property on them is undecidable. We go one step further in this article by giving a full characterization of the sets of T...

متن کامل

Automata and Transcendence of the Tate Period in Finite Characteristic

Using the techniques of automata theory, we give another proof of the function field analogue of the Mahler-Manin conjecture and prove transcendence results for the power series associated to higher divisor functions σk(n) = ∑ d|n d k. Let p be a prime number, and let k be an algebraic closure of Fp. Let q be a variable and consider a4, a6 ∈ k[[q]] defined by

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: International Journal of Computer & Information Sciences

سال: 1977

ISSN: 0091-7036,1573-7640

DOI: 10.1007/bf00991485